Two-parameter heavy-traffic limits for infinite-server queues
نویسندگان
چکیده
منابع مشابه
Two-parameter heavy-traffic limits for infinite-server queues
Abstract: In order to obtain Markov heavy-traffic approximations for infinite-server queues with general non-exponential service-time distributions and general arrival processes, possibly with time-varying arrival rates, we establish heavy-traffic limits for two-parameter stochastic processes. We consider the random variables Qe(t, y) and Qr(t, y) representing the number of customers in the sys...
متن کاملTwo-parameter heavy-traffic limits for infinite-server queues with dependent service times
This paper is a sequel to our 2010 paper in this journal in which we established heavy-traffic limits for two-parameter processes in infinite-server queues with an arrival process that satisfies an FCLT and i.i.d. service times with a general distribution. The arrival process can have a time-varying arrival rate. In particular, an FWLLN and an FCLT were established for the two-parameter process...
متن کاملTwo-parameter Heavy-traffic Limits for Infinite-server Queues: Longer Version
In order to obtain Markov heavy-traffic approximations for infinite-server queues with general non-exponential service-time distributions and general arrival processes, possibly with time-varying arrival rates, we establish heavy-traffic limits for two-parameter stochastic processes. We consider the random variables Qe(t, y) and Qr(t, y) representing the number of customers in the system at tim...
متن کاملHeavy-traffic fluid limits for periodic infinite-server queues
To better understand what stochastic model might be appropriate in applications with system data, we study the consequences of fitting a stationary birthand-death (BD) process to the sample path of a periodic Mt/GI/∞model. The fitted BD process will necessarily have the correct steady-state distribution (appropriately defined), but will not have the correct transient behavior. Nevertheless, the...
متن کاملHeavy-Traffic Limits for Loss Proportions in Single-Server Queues
We establish heavy-traffic stochastic-process limits for the queue-length and overflow stochastic processes in the standard single-server queue with finite waiting room (G/G/1/K). We show that, under regularity conditions, the content and overflow processes in related single-server models with finite waiting room, such as the finite dam, satisfy the same heavy-traffic stochastic-process limits....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2010
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-010-9184-z